Calculation of Loss Probability in a Finite Size Partitioned Buffer for Quantitative Assured Service

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quantitative Assured Forwarding Service

The Assured Forwarding (AF) service of the IETF DiffServ architecture provides a qualitative service differentiation between classes of traffic, in the sense that a low-priority class experiences higher loss rates and higher delays than a high-priority class. However, the AF service does not quantify the difference in the service given to classes. In an effort to strengthen the service guarante...

متن کامل

Comparison of two approximations for the loss probability in finite-buffer queues

This note deals with two related approximations that were recently proposed for the loss probability in finite-buffer queues. The purpose of the paper is two-fold. First, to provide better insight and more theoretical support for both approximations. Second, to show by an experimental study how well both approximations perform. An interesting empirical finding is that in many cases of practical...

متن کامل

A Simplified Blocking Probability Calculation in the Retry Loss Models for Finite Sources

We consider the single and multi-retry loss models for finite sources (f-SRM, f-MRM, respectively) in which calls of K service-classes are accommodated in a link of capacity C and compete for the available bandwidth under the complete sharing (CS) policy. Blocked calls can immediately retry one or more times to be connected in the system with reduced bandwidth and increased service time require...

متن کامل

Loss Probability for a Finite Buffer Multiplexer with the M/G/infinity Input Process

This paper studies the impact of long-range-dependent (LRD) traffic on the performance of a network multiplexer. The network multiplexer is characterized by a multiplexing queue with a finite buffer and an M/G/∞ input process. Our analysis expresses the loss probability bounds using a simple relationship between loss probability and buffer full probability. Our analysis also derives an exact ex...

متن کامل

Asymptotic Loss Probability in a Finite Buffer Fluid Queue with Heterogeneous

Consider a fluid queue with a finite buffer B and capacity c fed by a superposition of N independent On–Off processes. An On–Off process consists of a sequence of alternating independent periods of activity and silence. Successive periods of activity, as well as silence, are identically distributed. The process is active with probability p and during its activity period produces fluid at consta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2007

ISSN: 0090-6778

DOI: 10.1109/tcomm.2007.904394